Compaction of Diagnostic Test Set for a Full-Response Dictionary

نویسندگان

  • Mohammed Ashfaq Shukoor
  • Vishwani D. Agrawal
چکیده

We optimize the diagnostic data from a fullresponse fault dictionary of a given test set. Compaction is done without loss of diagnostic resolution of a test set. We give an integer linear program (ILP) formulation using fault diagnostic table. The complexity of the ILP is made manageable by two innovations. First, we define a generalized independence relation between pairs of faults to reduce the number of fault pairs that need to be distinguished. This significantly reduces the number of ILP constraints. Second, we propose a two-phase ILP approach. An initial ILP phase, which uses existing procedures, selects a minimal detection test set. In a final phase, additional tests are then selected for the undiagnosed faults using a new diagnostic ILP. The overall minimized test set may be only slightly longer than a one-step ILP optimization, but has advantages of significantly reduced computation complexity and reduced test time. Benchmark results show potential for very small diagnostic test sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diagnostic Test Set Minimization and Full-Response Fault Dictionary

We minimize a given test set without loss of diagnostic resolution in full-response fault dictionary. An integer linear program (ILP), formulated from fault simulation data, provides ultimate reduction of test vectors while preserving fault coverage and pairwise distinguishability of faults. The complexity of the ILP is made manageable by two innovations. First, we define a generalized independ...

متن کامل

Full fault dictionary storage based on labeled tree encoding

The process of fault dictionary compaction can lead to a loss of information that is potentially useful in locating unmodeled failures. The focus of this paper is on developing alternative storage structures that can efficiently represent full fault dictionaries without discarding any information. We present the problem of storing the full fault dictionary storage as a labeled tree encoding pro...

متن کامل

An Efficient Test Relaxation Technique for Combinational & Full-Scan Sequential Circuits

Reducing test data size is one of the major challenges in testing systems-on-a-chip. This problem can be solved by test compaction and/or compression techniques. Having a partially specified or relaxed test set increases the effectiveness of test compaction and compression techniques. In this paper, we propose a novel and efficient test relaxation technique for combinational and full-scan seque...

متن کامل

Proceedings of the International Test Conference , October 1998 Compact Two - Pattern Test Set Generation for Combinational and FullScan Circuits

This paper presents two algorithms for generating compact test sets for combinational and full scan circuits under the transition and CMOS stuck-open fault models; Redundant Vector Elimination (RVE) and Essential Fault Reduction (EFR). These algorithms together with the dynamic compaction algorithm are incorporated into an advanced ATPG system for combin-ational circuits, called MinTest. The te...

متن کامل

Approximate Membership of Sets: A Survey

The task of representing a set so as to support membership queries is a common one in computer science. If space is no object, a complete dictionary may provide accurate QUERYing in good runtime. If space is at a premium and the size of the set uncertain, Bloom filters and hash compaction provide good approximations. If the size is completely unknown, a modified Bloom filter provides very good ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009